Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem
نویسندگان
چکیده
منابع مشابه
A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملA new mixed integer linear programming model for the multi level uncapacitated facility location problem
This paper considers the multi level uncapacitated facility location problem (MLUFLP). A new mixed integer linear programming (MILP) formulation is presented and validity of this formulation is given. Experimental results are performed on instances known from literature. The results achieved by CPLEX and Gurobi solvers, based on the proposed MILP formulation, are compared to the results obtaine...
متن کاملInteger Programming Model and Exact Solution for Concentrator Location Problem
Topological design of centralized computer networks is an important problem that has been investigated by many researchers. Such networks typically involve a large number of terminals connected to concentrators, that are then connected to a central computing site. This paper focuses on the concentrator location problem among general topological network design problems. The concentrator location...
متن کاملThe Online Connected Facility Location Problem
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online version of the Connected Facility Location problem (CFL). The CFL is a combination of the Uncapacitated Facility Location problem (FL) and the Steiner Tree problem (ST). We give a randomized O(log n)-competitive algorithm for the OCFL via the sample-and-augment framework of Gupta, Kumar, Pál, and ...
متن کاملApproximation Algorithms for Single and Multi-Commodity Connected Facility Location
In the classical facility location problemwe are given a set of facilities, with associated opening costs, and a set of clients. The goal is to open a subset of facilities, and to connect each client to the closest open facility, so that the total connection and opening cost is minimized. In some applications, however, open facilities need to be connected via an infrastructure. Furthermore, con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Science and Information
سال: 2014
ISSN: 2512-6660
DOI: 10.1515/jssi-2014-0451